- Monte Carlo simulated annealing
- Макаров: метод модельного отжига в рамках метода Монте-Карло
Универсальный англо-русский словарь. Академик.ру. 2011.
Monte Carlo simulated annealing
Смотреть что такое "Monte Carlo simulated annealing" в других словарях:
Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… … Wikipedia
Monte Carlo method in statistical physics — Monte Carlo in statistical physics refers to the application of the Monte Carlo method to problems in statistical physics, or statistical mechanics. Contents 1 Overview 2 Importance sampling 2.1 Canonical … Wikipedia
Monte Carlo molecular modeling — is the application of Monte Carlo methods to molecular problems. These problems can also be modeled by the molecular dynamics method. The difference is that this approach relies on statistical mechanics rather than molecular dynamics. Instead of… … Wikipedia
Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics … Wikipedia
Quantum annealing — In mathematics and applications, quantum annealing (QA) is a general method for finding the global minimum of a given objective function over a given set of candidate solutions (the search space ), by a process analogous to quantum fluctuations.… … Wikipedia
GNU Scientific Library — Pour les articles homonymes, voir GSL. GNU Scientific Library … Wikipédia en Français
GNU Scientific Library — Desarrollador proyecto GNU gnu.org/software/gsl/ Información general Última versión estable 1.14 12 de marzo 2010 … Wikipedia Español
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Nicholas Metropolis — Nicholas Constantine Metropolis Born June 11, 1915(1915 06 11) Chicago … Wikipedia
Global optimization — is a branch of applied mathematics and numerical analysis that deals with the optimization of a function or a set of functions to some criteria. General The most common form is the minimization of one real valued function f in the parameter space … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
